Cryptanalysis of Multi Prime RSA with Secret Key Greater than Public Key
نویسندگان
چکیده
The efficiency of decryption process of Multi prime RSA, in which the modulus contains more than two primes, can be speeded up using Chinese remainder theorem (CRT). On the other hand, to achieve the same level of security in terms integer factorization problem the length of RSA modulus must be larger than the traditional RSA case. In [9], authors studied the RSA public key cryptosystem in a special case with the secret exponent d larger than the public exponent e. In this paper, we show that how such attack is performed in the multi-prime RSA case.
منابع مشابه
Serious Security Weakness in RSA Cryptosystem
Nowadays, RSA is the well-known cryptosystem which supports most of electronic commercial communications. RSA is working on the base of multiplication of two prime numbers. Currently different kinds of attacks have indentified against RSA by cryptanalysis. This paper has shown that regardless to the size of secret key and public key, it is possible to decrypt one cipher text by different secret...
متن کاملEfficient Two Party Multi-prime Rsa Key Generation
We present a new protocol which enables two parties to jointly generate a multi-prime RSA key pair such that neither party gains information about the secret key. The expected running time of our algorithm is linear in the bit length of the modulus which is significantly faster than previously known methods.
متن کاملPartial Key Exposure Attacks on Rsa and Its Variant by Guessing a Few Bits of One of the Prime Factors
Consider RSA with N = pq, q < p < 2q, public encryption exponent e and private decryption exponent d. We first study cryptanalysis of RSA when certain amount of the Most Significant Bits (MSBs) or Least Significant Bits (LSBs) of d is known. The basic lattice based technique is similar to that of Ernst et al. in Eurocrypt 2005. However, our idea of guessing a few MSBs of the secret prime p subs...
متن کاملCryptanalysis of RSA with Small Prime Difference using Unravelled Linearization
R. Rivest, A. Shamir and L. Adleman," A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", Communications of the ACM, vol. 21, No. 2, pp. 120-126,1978. Wiener, M. : Cryptanalysis of short RSA secret exponents, IEEE Transactions on Information Theory 36, 553-558 (1990). Boneh, D. , Durfee, G. : Cryptanalysis of RSA with Private Key d Less Than N^0. 292, Advances in ...
متن کاملA Generalized Wiener Attack on RSA
We present an extension of Wiener’s attack on small RSA secret decryption exponents [10]. Wiener showed that every RSA public key tuple (N, e) with e ∈ ∗ φ(N) that satisfies ed − 1 = 0 mod φ(N) for some d < 1 3 N 1 4 yields the factorization of N = pq. Our new method finds p and q in polynomial time for every (N, e) satisfying ex + y = 0 mod φ(N) with x < 1 3 N 1 4 and |y| = O(N− 3 4 ex). In ot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- I. J. Network Security
دوره 16 شماره
صفحات -
تاریخ انتشار 2014